Balanced k-colorings
نویسندگان
چکیده
منابع مشابه
Balanced k-Colorings
While discrepancy theory is normally only studied in the context of 2-colorings, we explore the problem of k-coloring, for k 2, a set of vertices to minimize imbalance among a family of subsets of vertices. The imbalance is the maximum, over all subsets in the family, of the largest diierence between the size of any two color classes in that subset. The discrepancy is the minimum possible imbal...
متن کاملBalanced edge colorings
This paper contains two principal results. The first proves that any graph G can be given a balanced proper edge coloring by k colors for any k ≥ χ′(G). Here balanced means that the number of vertices incident with any set of d colors is essentially fixed for each d, that is, for two different d-sets of colors the number of vertices incident with each of them can differ by at most 2. The second...
متن کاملSplit and balanced colorings of complete graphs
An (r, n)-split coloring of a complete graph is an edge coloring with r colors under which the vertex set is partitionable into r parts so that for each i, part i does not contain K, in color i. This generalizes the notion of split graphs which correspond to (2, 2)-split colorings. The smallest N for which the complete graph Ks has a coloring which is not (r,n)-split is denoted by f,.(n). Balan...
متن کاملMultiply balanced edge colorings of multigraphs
In this paper, a theorem is proved that generalizes several existing amalgamation results in various ways. The main aim is to disentangle a given edge-colored amalgamated graph so that the result is a graph in which the edges are shared out among the vertices in ways that are fair with respect to several notions of balance (such as between pairs of vertices, degrees of vertices in the both grap...
متن کاملOn balanced colorings of sparse hypergraphs
We investigate 2-balanced colorings of sparse hypergraphs. As applications, we derive several results on balanced edge-colorings of multigraphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00431-9